#include<bits/stdc++.h>
using namespace std;
int n,a[100005],ans;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    for(int i=1,j=1;i<=n;i=++j){
        while(j<n && a[j+1]==a[i])j++;
        ans=max(ans,j-i+1);
    }
    printf("%d",ans);
}
